binary alphabetの例文

• A Sturmian word over a binary alphabet is one with complexity function " n " + 1.
• For example, the collection of all binary strings that contain exactly 3 ones is a language over the binary alphabet.
• For example, using the binary alphabet { 0, 1 }, the strings ?, 0, 1, 00, 01, 10, 11, 000, etc . are all in the Kleene closure of the alphabet ( where ? represents the empty string ).
• Assuming a sequence of independent and identically distributed input signals ( for example, symbols from a binary alphabet chosen by coin tosses ), if the machine is in state " y " at time " n ", then the probability that it moves to state " x " at time " n " + 1 depends only on the current state.
• For instance, for an FSG over the binary alphabet \ Sigma = \ { 0, 1 \ }, the current state " q " bets some percentage q _ 0 \ in [ 0, 1 ] of the gambler's money on the bit 0, and the remaining q _ 1 = 1-q _ 0 fraction of the gambler's money on the bit 1.